A Novel Anti-collision Backtracking Algorithm Based on Binary-tree Search in UHF

نویسنده

  • Wang Jianfang
چکیده

To anti-collision problem of multiple tags of RFID in ETC (Electronic Toll Collection) system, a novel BBS (Backtracking Binary-tree Search ) anti-collision algorithm is proposed in working in UHF (5.8G) based on the DBS (Dynamic Binary-tree Search) and RSBS (Random Split Binary-tree Search) to solve the only one bit collision in inquiry. The BBS algorithm can reduce twice inquiry process. The simulation in UHF (5.8G) show that the BBS algorithm can reduce the number of inquires and information sent to improve the ETC system efficiency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Tree-based Tag Anti-collision Protocol for RFID Systems

This paper proposes a tree-based anti-collision protocol for tags in the UHF (ultra high frequency, 300MHz–3GHz) band. To reduce the step for searching all tags in the interrogation zone, the depth-first search (DFS) is used as a basic search criterion like in query tree protocols. To prevent the redundant increase of the transmission bit length in process of implementing the DFS, the binary tr...

متن کامل

Bilateral Teleoperation Systems Using Backtracking Search optimization Algorithm Based Iterative Learning Control

This paper deals with the application of Iterative Learning Control (ILC) to further improve the performance of teleoperation systems based on Smith predictor. The goal is to achieve robust stability and optimal transparency for these systems. The proposed control structure make the slave manipulator follow the master in spite of uncertainties in time delay in communication channel and model pa...

متن کامل

A Novel RFID Anti-Collision Algorithm based on Binary Tree

The method to deal with the tag collision in RFID system can be directly called “Multiple Access”. According to the ideas of these different anti-collision algorithms, they can be divided into two categories. One is the binary tree algorithm based on deterministic; the other is the statistical-based ALOHA algorithm. Overall, however, there is still room for improvement on anti-collision algorit...

متن کامل

Improvement of Anti-Collision Performance for the ISO 18000-6 Type B RFID System

This paper proposes a novel method to suppress tag collision in the ISO 18000-6 type B protocol which is one of the standard protocols of UHF RFID systems. The anti-collision performance in terms of the total identification time is improved by reducing the length of bits and the number of transmission commands required for multi-tag identification in the ISO 18000-6 type B protocol. Simulation ...

متن کامل

Research of RFID Tag Anti-collision Algorithm based on Binary Tree

To solve the RFID tag collision problem, a new anti-collision algorithm is proposed by improving the binary tree search algorithm. Through improving the requesting establishment, this algorithm reduces the probability of collision bits and the number of tags requiring collision detection time by using the even number bits for impact identification. The simulation results show that compared with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010